2 ) for the ability of searching , a formula of adaptive crossover rate decreasing with the increasing of genetic generation 2 )設(shè)計(jì)出余弦下降的自適應(yīng)交叉率公式以改善遺傳算法搜索能力。
( 3 ) an adaptive crossover operator , an adaptive mutation operator and a multiple and variable elitist operator are proposed to enhance the reliability and efficiency of ga ( 3 )提出了自適應(yīng)雜交、自適應(yīng)突變和多重動(dòng)態(tài)優(yōu)選等遺傳算子,旨在提高ga的可靠性和效率。
The simulation results indicate the validities of the proposed hybrid optimization algorithm and the compute method of self - adaptive crossover probability and mutation probability . 2 仿真研究表明所提混合優(yōu)化算法及自適應(yīng)交叉概率和變異概率的計(jì)算方法在求解本文交通信號(hào)動(dòng)態(tài)優(yōu)化控制問題中的有效性。
So the improvement , such as the self - adaptive fitness function combined with the penalty function methods , self - adaptive crossover probability and the bp operator enlightened by neutral network , especially the bp network to improve the local optimal capacity were used 其次結(jié)合懲罰函數(shù)法對(duì)適應(yīng)度進(jìn)行了優(yōu)化。采用自適應(yīng)交叉概率。受神經(jīng)網(wǎng)絡(luò)中bp算法的啟示,構(gòu)造bp算子,提高小種群遺傳算法的局部搜索尋優(yōu)能力。
When carrying on the distribution network reactive power coordination optimization , the discrete values of compensation capacitor are obtained using adaptive crossover step genetic algorithm on the basis of consideration of bo th network reconfiguration based on ts algorithm and compensation capacitors continuous variable optimization , accordingly the high efficiency and global optimal solution of network coordination reactive optimization are achieved 對(duì)配電網(wǎng)絡(luò)無功綜合優(yōu)化,本文提出在同時(shí)考慮基于禁忌算法的配電網(wǎng)絡(luò)重構(gòu)和補(bǔ)償電容器連續(xù)變量?jī)?yōu)化的基礎(chǔ)上,再應(yīng)用自適應(yīng)交叉步長(zhǎng)遺傳算法進(jìn)行離散變量求解,獲得補(bǔ)償電容器的離散量值。
Simple genetic algorithm gets local minimization too easily and converges slowly . to solve these problems , adaptive crossover rate that has reverse hyperbolic rel ation with the numbers of iteration is designed , and adaptive mutation rate that has reverse proportion to the distances of parents and reverse exponential relat ion to the numbers of iteration is put forward . the practical simulation results show that the adaptive ga has greater convergence speed and larger probability o f getting the best solution 簡(jiǎn)單遺傳算法存在著收斂速度慢、易陷入局部極小等缺陷.針對(duì)這些缺陷,本文設(shè)計(jì)出隨相對(duì)遺傳代數(shù)呈雙曲線下降的自適應(yīng)交換率,并提出與父串間的相對(duì)歐氏距離成反比、隨相對(duì)遺傳代數(shù)指數(shù)下降的自適應(yīng)變異率.實(shí)例驗(yàn)證表明,具有自適應(yīng)交換率和變異率的遺傳算法在收斂速度和獲得全局最優(yōu)解的概率兩個(gè)方面都有很大的提高
On the base of the research of the theory of genetic algorithm and the method of genetic operation , improved on the method of genetic operation , put forward one formula of the adaptive crossover and adaptive mutation , proved the genetic algorithm ability of the global optimization result in non - linear combination optimization by the math example 在對(duì)遺傳算法的理論和遺傳操作方法進(jìn)行研究的基礎(chǔ)上,對(duì)遺傳操作進(jìn)行了部分改進(jìn),構(gòu)造了一種自適應(yīng)交叉率和變異率的公式,通過數(shù)學(xué)算例證明了遺傳算法在非線性組合優(yōu)化問題中全局搜索能力。